REPRESENTATION THEOREMS AND PRIMITIVE PREDICATES FOR LOGIC PROGRAMS
نویسندگان
چکیده
منابع مشابه
Learning Conceptual Predicates for Teleoreactive Logic Programs
Teleoreactive logic programs provide a formalism for describing conceptual and skill knowledge that is organized hierarchically. However, manual construction of the conceptual clauses is tedious and often requires expert knowledge. In this paper, we present an approach to defining new conceptual predicates from successfully solved problems. We provide experimental results that demonstrate these...
متن کاملKnowledge Representation with Logic Programs Knowledge Representation with Logic Programs
In this tutorial-overview, which resulted from a lecture course given by the authors at the European Summer School in Logic, Language and Information 1997 in Aix-en-Provence ( ), we show how knowledge representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on definite logic programs. Although this class is very rest...
متن کاملDynamic Predicates in Functional Logic Programs
In this paper we propose a new concept to deal with dynamic predicates in functional logic programs. The definition of a dynamic predicate can change over time, i.e., one can add or remove facts that define this predicate. Our approach is easy to use and has a clear semantics that does not depend on the particular (demand-driven) evaluation strategy of the underlying implementation. In particul...
متن کاملConstructing Logic Programs with Higher-Order Predicates
This paper proposes a logic programming approach based on the application of a system of higher-order predicates put at disposal within ordinary logic programming languages such as prolog. These higher-order predicates parallel the higher-order functionals or combinators which form an established part of contemporary functional programming methodology. The suggested toolbox of higher-order pred...
متن کاملFunctional Logic Programs with Dynamic Predicates
In this paper we propose a new concept to deal with dynamic predicates in functional logic programs. The definition of a dynamic predicate can change over time, i.e., one can add or remove facts that define this predicate. Our approach is easy to use and has a clear semantics that does not depend on the particular (demand-driven) evaluation strategy of the underlying implementation. In particul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1986
ISSN: 0286-522X
DOI: 10.5109/13374